Local Fractional Strong Metric Dimension of Certain Complex Networks
نویسندگان
چکیده
Fractional variants of distance-based parameters have application in the fields sensor networking, robot navigation, and integer programming problems. Complex networks are exceptional which exhibit significant topological features become quintessential research area field computer science, biology, mathematics. Owing to possibility that many real-world systems can be intelligently modeled represented as complex examine, administer comprehend useful information from these networks. In this paper, local fractional strong metric dimension certain is computed. Building blocks considered symmetric such cyclic C n , circulant id="M2"> 1,2 mobious ladder id="M3"> M 2 generalized prism id="M4"> G m . regard, it shown LSFMD id="M5"> ≥ 3 id="M6"> 6 1 when id="M7"> even id="M8"> / − 1 id="M9"> odd, whereas id="M10"> id="M11"> odd id="M12"> id="M13"> even. Also, id="M14"> id="M15"> ⌈ + ⌉ where id="M16"> id="M17"> = 5 4
منابع مشابه
Local Dimension of Complex Networks
Dimensionality is one of the most important properties of complex physical systems. However, only recently this concept has been considered in the context of complex networks. In this paper we further develop the previously introduced definitions of dimension in complex networks by presenting a new method to characterize the dimensionality of individual nodes. The methodology consists in obtain...
متن کاملOn the metric dimension and fractional metric dimension for hierarchical product of graphs
A set of vertices W resolves a graph G if every vertex of G is uniquely determined by its vector of distances to the vertices in W . The metric dimension for G, denoted by dim(G), is the minimum cardinality of a resolving set of G. In order to study the metric dimension for the hierarchical product G2 2 uG1 1 of two rooted graphs G2 2 and G u1 1 , we first introduce a new parameter, the rooted ...
متن کاملOn Minimum Metric Dimension of Circulant Networks
Let M = } ,..., , { 2 1 n v v v be an ordered set of vertices in a graph G. Then )) , ( ),..., , ( ), , ( ( 2 1 n v u d v u d v u d is called the M-coordinates of a vertex u of G. The set M is called a metric basis if the vertices of G have distinct M-coordinates. A minimum metric basis is a set M with minimum cardinality. The cardinality of a minimum metric basis of G is called minimum metric ...
متن کاملOn minimum metric dimension of honeycomb networks
A minimum metric basis is a minimum set W of vertices of a graph G(V,E) such that for every pair of vertices u and v of G, there exists a vertex w ∈ W with the condition that the length of a shortest path from u to w is different from the length of a shortest path from v to w. The honeycomb and hexagonal networks are popular mesh-derived parallel architectures. Using the duality of these networ...
متن کاملOn the Strong Metric Dimension of Cartesian Sum Graphs
A vertex w of a connected graph G strongly resolves two vertices u, v ∈ V (G), if there exists some shortest u−w path containing v or some shortest v−w path containing u. A set S of vertices is a strong metric generator for G if every pair of vertices of G is strongly resolved by some vertex of S. The smallest cardinality of a strong metric generator for G is called the strong metric dimension ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexity
سال: 2023
ISSN: ['1099-0526', '1076-2787']
DOI: https://doi.org/10.1155/2023/3635342